Resolution limit in community detection
نویسندگان
چکیده
منابع مشابه
Resolution limit in community detection.
Detecting community structure is fundamental for uncovering the links between structure and function in complex networks and for practical applications in many disciplines such as biology and sociology. A popular method now widely used relies on the optimization of a quantity called modularity, which is a quality index for a partition of a network into communities. We find that modularity optim...
متن کاملOn Resolution Limit of the Modularity in Community Detection
Modularity Q has been broadly used as a valid measure for community detection in complex networks. Fortunato and Barthélemy later proposed that modularity contains an intrinsic scale that depends on the total number of links in the network. But some extra restrictions on some parameters are needed for their analysis. In this paper we further study this problem. Here we give general analysis and...
متن کاملNarrow scope for resolution-limit-free community detection.
Detecting communities in large networks has drawn much attention over the years. While modularity remains one of the more popular methods of community detection, the so-called resolution limit remains a significant drawback. To overcome this issue, it was recently suggested that instead of comparing the network to a random null model, as is done in modularity, it should be compared to a constan...
متن کاملLocal resolution-limit-free Potts model for community detection.
We report on an exceptionally accurate spin-glass-type Potts model for community detection. With a simple algorithm, we find that our approach is at least as accurate as the best currently available algorithms and robust to the effects of noise. It is also competitive with the best currently available algorithms in terms of speed and size of solvable systems. We find that the computational dema...
متن کاملTolerating the community detection resolution limit with edge weighting.
Communities of vertices within a giant network such as the World Wide Web are likely to be vastly smaller than the network itself. However, Fortunato and Barthélemy have proved that modularity maximization algorithms for community detection may fail to resolve communities with fewer than √L/2 edges, where L is the number of edges in the entire network. This resolution limit leads modularity max...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 2006
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.0605965104